Shortest Path Network Interdiction With Goal Threshold
نویسندگان
چکیده
منابع مشابه
Shortest-path network interdiction
We study the problem of interdicting the arcs in a network in order to maximize the shortest s–t path length. “Interdiction” is an attack on an arc that destroys the arc or increases its effective length; there is a limited interdiction budget. We formulate this bilevel, max–min problem as a mixed-integer program (MIP), which can be solved directly, but we develop more efficient decomposition a...
متن کاملRisk-Averse Shortest Path Interdiction
We consider a Stackelberg game in a network, where a leader minimizes the cost of interdicting arcs and a follower seeks the shortest distance between given origin and destination nodes under uncertain arc traveling cost. In particular, we consider a risk-averse leader, who aims to keep high probability that the follower’s traveling distance is longer than a given threshold, interpreted by a ch...
متن کاملSequential Shortest Path Interdiction with Incomplete Information
We study sequential interdiction when the interdictor has incomplete initial information about the network, and the evader has complete knowledge of the network, including its structure and arc costs. In each time period, the interdictor blocks at most k arcs from the network observed up to that period, after which the evader travels along a shortest path between two (fixed) nodes in the interd...
متن کاملInapproximability Bounds for Shortest-Path Network Interdiction Problems
We consider two network interdiction problems: one where a network user tries to traverse a network from a starting vertex s to a target vertex t along the shortest path while an interdictor tries to eliminate all short s-t paths by destroying as few vertices (arcs) as possible, and one where the network user, as before, tries to traverse the network from s to t along the shortest path while th...
متن کاملMultiobjective shortest path problems with lexicographic goal-based preferences
Multiobjective shortest path problems are computationally harder than single objective ones. In particular, execution time is an important limiting factor in exact multiobjective search algorithms. This paper explores the possibility of improving search performance in those cases where the interesting portion of the Pareto front can be initially bounded. We introduce a new exact label-setting a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2838570